A Variable Radius Niching Technique for Speciation in Genetic Algorithms
نویسندگان
چکیده
In this paper, a continuation of a variable radius niche technique called Dynamic Niche Clustering developed by (Gan & Warwick, 1999) is presented. The technique employs a separate dynamic population of overlapping niches that coexists alongside the normal population. An empirical analysis of the updated methodology on a large group of standard optimisation test-bed functions is also given. The technique is shown to perform almost as well as standard fitness sharing with regards to stability and the accuracy of peak identification, but it outperforms standard fitness sharing with regards to time complexity. It is also shown that the technique is capable of forming niches of varying size depending on the characteristics of the underlying peak that the niche is populating.
منابع مشابه
Scalability of niche PSO
In contrast to optimization techniques intended to find a single, global solution in a problem domain, niching (speciation) techniques have the ability to locate multiple solutions in multimodal domains. Numerous niching techniques have been proposed, broadly classified as temporal (locating solutions sequentially) and parallel (multiple solutions are found concurrently) techniques. Most resear...
متن کاملDynamic Niche Clustering: A Fuzzy Variable Radius Niching Technique for Multimodal Optimisation in GAs
This paper describes the recent developments and improvements made to the variable radius niching technique called Dynamic Niche Clustering (DNC) originally described in [4] and [5]. DNC employs a separate population of overlapping fuzzy niches with independent radii which operate in the decoded parameter space and are maintained alongside the normal GA population. We describe a speedup process...
متن کاملA Comparison of Parallel and Sequential
Niching methods extend genetic algorithms to domains that require the location of multiple solutions. This study examines and compares four niching methods | sharing, crowding, sequential niching, and parallel hillclimbing. It focuses on the diierences between parallel and sequential niching. The niching methods undergo rigorous testing on optimization and classiication problems of increasing d...
متن کاملAn Efficient Hierarchical Clustering Technique for Speciation
The sharing method or the basic clearing procedure are reliable niching methods. However, they suffer from a quite high complexity: from O(n2) to O(c n), where c is the number of subpopulations and n is the population size. In this paper, an efficient hierarchical clustering technique is presented, reducing the complexity of these niching methods to O(n log n). On the other hand, the minimal ni...
متن کاملAn Explicit Spatial Model for Niching in Genetic Algorithms
A niching technique is an important component of the genetic algorithm when attempting to solve problems that have multiple optimal solutions. Traditional niching techniques use an explicit concept of similarity to perform the actual niche formation. Often, the definition of this similarity function is difficult or requires a priori knowledge of the problem domain. This paper investigates the u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000